Line and Cell Searching in Tables or Forms
Identifieur interne : 00C543 ( Main/Exploration ); précédent : 00C542; suivant : 00C544Line and Cell Searching in Tables or Forms
Auteurs : E. Turolla ; Y. Belaïd ; Abdel Belaïd [France]Source :
English descriptors
Abstract
Item searching is an important step in form analysis. The goal of this paper is to describe a robust method to locate the items whose boundaries are black lines, and an algorithm to classify those items. Our method is based on detection of lines by Hough transform and on searching of cycles in a graph that represents the cells (boundaries of the items). We will show that our approach is robust, skew independent and can be applied to several kind of lines such as continuous, dashed, doubled, etc. We classify the items in four categories : blank, black, gray and meaningful.
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001919
- to stream Crin, to step Curation: 001919
- to stream Crin, to step Checkpoint: 002D55
- to stream Main, to step Merge: 00CE00
- to stream Main, to step Curation: 00C543
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="176">Line and Cell Searching in Tables or Forms</title></titleStmt><publicationStmt><idno type="RBID">CRIN:turolla95b</idno><date when="1995" year="1995">1995</date><idno type="wicri:Area/Crin/Corpus">001919</idno><idno type="wicri:Area/Crin/Curation">001919</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001919</idno><idno type="wicri:Area/Crin/Checkpoint">002D55</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002D55</idno><idno type="wicri:Area/Main/Merge">00CE00</idno><idno type="wicri:Area/Main/Curation">00C543</idno><idno type="wicri:Area/Main/Exploration">00C543</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Line and Cell Searching in Tables or Forms</title><author><name sortKey="Turolla, E" sort="Turolla, E" uniqKey="Turolla E" first="E." last="Turolla">E. Turolla</name></author><author><name sortKey="Belaid, Y" sort="Belaid, Y" uniqKey="Belaid Y" first="Y." last="Belaïd">Y. Belaïd</name></author><author><name sortKey="Belaid, A" sort="Belaid, A" uniqKey="Belaid A" first="A." last="Belaïd">Abdel Belaïd</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>French tex form</term><term>Hough transform</term><term>item extraction</term><term>line searching</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1306">Item searching is an important step in form analysis. The goal of this paper is to describe a robust method to locate the items whose boundaries are black lines, and an algorithm to classify those items. Our method is based on detection of lines by Hough transform and on searching of cycles in a graph that represents the cells (boundaries of the items). We will show that our approach is robust, skew independent and can be applied to several kind of lines such as continuous, dashed, doubled, etc. We classify the items in four categories : blank, black, gray and meaningful.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement><orgName><li>Centre national de la recherche scientifique</li><li>Institut national de recherche en informatique et en automatique</li><li>Laboratoire lorrain de recherche en informatique et ses applications</li><li>Université de Lorraine</li></orgName></list><tree><noCountry><name sortKey="Belaid, Y" sort="Belaid, Y" uniqKey="Belaid Y" first="Y." last="Belaïd">Y. Belaïd</name><name sortKey="Turolla, E" sort="Turolla, E" uniqKey="Turolla E" first="E." last="Turolla">E. Turolla</name></noCountry><country name="France"><region name="Grand Est"><name sortKey="Belaid, A" sort="Belaid, A" uniqKey="Belaid A" first="A." last="Belaïd">Abdel Belaïd</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C543 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C543 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:turolla95b
|texte= Line and Cell Searching in Tables or Forms
}}
| This area was generated with Dilib version V0.6.33. |  |